/*
 Problem Description
we define f(A) = 1, f(a) = -1, f(B) = 2, f(b) = -2, ... f(Z) = 26, f(z) = -26;
Give you a letter x and a number y , you should output the result of y+f(x).
 

Input
On the first line, contains a number T.then T lines follow, each line is a case.each case contains a letter and a number.
 

Output
for each case, you should the result of y+f(x) on a line.
 

Sample Input
6
R 1
P 2
G 3
r 1
p 2
g 3
 

Sample Output
19
18
10
-17
-14
-4
-------------------------------------------------------------
字母与ASCII码表的对应关系为：字母n的位数=n-64，小写字母比大写字母的值大32。
 */
package com.yuan.algorithms.acm201504;

import java.util.Scanner;

public class HD2055字母函数与整数的和 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int k = sc.nextInt();
			for (int i = 0; i < k; i++) {
				char a = sc.next().charAt(0);
				int n = sc.nextInt();
				f(a,n);
			}
		}

	}

	private static void f(char a, int n) {
		int x = a - 64 - 32;
		x = x < 0 ? x + 32 : -x;
		System.out.println(x+n);
	}

}
